Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubesGREGOR, Petr.Discrete mathematics. 2009, Vol 309, Num 6, pp 1711-1713, issn 0012-365X, 3 p.Article

On the maximum number of edges in a hypergraph with a unique perfect matchingBAL, Deepak; DUDEK, Andrzej; YILMA, Zelealem B et al.Discrete mathematics. 2011, Vol 311, Num 21, pp 2577-2580, issn 0012-365X, 4 p.Article

Elementary components of essentially disconnected polyomino graphsSHOULIU WEI; XIAOLING KE.Journal of mathematical chemistry. 2010, Vol 47, Num 1, pp 496-504, issn 0259-9791, 9 p.Article

A quadratic identity for the number of perfect matchings of plane graphsWEIGEN YAN; FUJI ZHANG.Theoretical computer science. 2008, Vol 409, Num 3, pp 405-410, issn 0304-3975, 6 p.Article

A note on minimal matching covered graphsMKRTCHYAN, V. V.Discrete mathematics. 2006, Vol 306, Num 4, pp 452-455, issn 0012-365X, 4 p.Article

Matching preclusion for k-ary n-cubesSHIYING WANG; RUIXIA WANG; SHANGWEI LIN et al.Discrete applied mathematics. 2010, Vol 158, Num 18, pp 2066-2070, issn 0166-218X, 5 p.Article

On the role of hypercubes in the resonance graphs of benzenoid graphsSALEM, Khaled; KLAVZAR, Sandi; GUTMAN, Ivan et al.Discrete mathematics. 2006, Vol 306, Num 7, pp 699-704, issn 0012-365X, 6 p.Article

Conditional matching preclusion for hypercube-like interconnection networksPARK, Jung-Heum; SANG HYUK SON.Theoretical computer science. 2009, Vol 410, Num 27-29, pp 2632-2640, issn 0304-3975, 9 p.Article

A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd orderCIUCU, Mihai.Discrete mathematics. 2007, Vol 307, Num 15, pp 1957-1960, issn 0012-365X, 4 p.Article

Regular generalized polyomino graphsWANG, Shou-Zhong; RONG SI CHEN.Journal of mathematical chemistry. 2007, Vol 42, Num 4, pp 957-967, issn 0259-9791, 11 p.Article

On the sextet polynomial of fullerenesSERENI, Jean-Sébastien; STEHLIK, Matĕj.Journal of mathematical chemistry. 2010, Vol 47, Num 3, pp 1121-1128, issn 0259-9791, 8 p.Article

ON PERFECT MATCHINGS IN UNIFORM HYPERGRAPHS WITH LARGE MINIMUM VERTEX DEGREEHAN, Hiêp; PERSON, Yury; SCHACHT, Mathias et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 732-748, issn 0895-4801, 17 p.Article

Fullerene graphs with exponentially many perfect matchingsDOSLIC, Tomislav.Journal of mathematical chemistry. 2007, Vol 41, Num 2, pp 183-192, issn 0259-9791, 10 p.Article

Connections between Wiener index and matchingsWEIGEN YAN; YEH, Yeong-Nan.Journal of mathematical chemistry. 2006, Vol 39, Num 2, pp 389-399, issn 0259-9791, 11 p.Article

Leapfrog fullerenes have many perfect matchingsDOSLIC, Tomislav.Journal of mathematical chemistry. 2008, Vol 44, Num 1, pp 1-4, issn 0259-9791, 4 p.Article

A simple, nearly perfectly matched layer for general electromagnetic mediaCUMMER, Steven A.IEEE microwave and wireless components letters. 2003, Vol 13, Num 3, pp 128-130, issn 1531-1309, 3 p.Article

An improved perfectly matched layer for the eigenmode expansion techniqueGREGERSEN, Niels; MØRK, Jesper.Optical and quantum electronics. 2008, Vol 40, Num 11-12, pp 957-966, issn 0306-8919, 10 p.Conference Paper

2-extendability and k-resonance of non-bipartite Klein-bottle polyhexesQIULI LI; SAIHUA LIU; HEPING ZHANG et al.Discrete applied mathematics. 2011, Vol 159, Num 8, pp 800-811, issn 0166-218X, 12 p.Article

On the sum-connectivity index of cactiFEIYING MA; HANYUAN DENG.Mathematical and computer modelling. 2011, Vol 54, Num 1-2, pp 497-507, issn 0895-7177, 11 p.Article

Maximally resonant polygonal systemsSAIHUA LIU; HEPING ZHANG.Discrete mathematics. 2010, Vol 310, Num 21, pp 2790-2800, issn 0012-365X, 11 p.Article

2-extendability of toroidal polyhexes and Klein-bottle polyhexesDONG YE; HEPING ZHANG.Discrete applied mathematics. 2009, Vol 157, Num 2, pp 292-299, issn 0166-218X, 8 p.Article

Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal systemSHAN ZHOU; HEPING ZHANG; GUTMAN, Ivan et al.Discrete applied mathematics. 2008, Vol 156, Num 10, pp 1809-1821, issn 0166-218X, 13 p.Article

Conditional matching preclusion for the arrangement graphsCHENG, Eddie; LIPMAN, Marc J; LIPTAK, László et al.Theoretical computer science. 2011, Vol 412, Num 45, pp 6279-6289, issn 0304-3975, 11 p.Article

Further results on atom-bond connectivity index of treesRUNDAN XING; BO ZHOU; ZHIBIN DU et al.Discrete applied mathematics. 2010, Vol 158, Num 14, pp 1536-1545, issn 0166-218X, 10 p.Article

Graphs with no M-alternating paths between two vertices: An updateDINGJUN LOU.Discrete mathematics. 2010, Vol 310, Num 23, pp 3429-3431, issn 0012-365X, 3 p.Article